Browsing by Subject "adjacency matrix"
Now showing items 1-1 of 1
-
The k-core of an undirected graph is the largest subgraph in which every vertex has a degree of at least some number k. Computing the k-core, also known as the k-core decomposition algorithm, has significant applications ...